CMWU achieves constant regret ofln(m)/η in all normal-form games with m actions and fixed step-sizesη.

Finally we show that when the goal isminimizing regret, rather than computing a Nash equilibrium, our optimistic methods can outperformCFR+,evenindeepgametrees.

Successfully employing cutting planes can be challenging because there are infinitely many cuts to choose from and there are still many open questions about which cuts to employ when.

For environments with large time horizons, we show that the principal's optimal

Current subgame-solving techniques analyze the entire common-knowledge closureof the player's current information set, that is, the smallest set of nodes within which it is common knowledge that the currentnodelies.